A new exact algorithm to solve the multi-trip vehicle routing problem with time windows and limited duration
نویسندگان
چکیده
منابع مشابه
A new exact algorithm to solve the multi-trip vehicle routing problem with time windows and limited duration
This article tackles the multi-trip vehicule routing problem with time windows and limited duration. A trip is a timed route such that a succession of trips can be assigned to one vehicle. We provide a two-phase exact algorithm to solve it. The first phase enumerates possible ordered lists of client matching trip maximum duration criterion. The second phase uses a Branch and Price scheme to gen...
متن کاملEvolutionary Local Search Algorithm to Solve the Multi-Compartment Vehicle Routing Problem with Time Windows
Vehicle routing problems (VRPs) represent an important research stream in applied combinatorial optimization. As the problems emerging from the practice become more constrained and large, more sophisticated approaches are required to address them. This paper tackles the Multiple Compartment Vehicle Routing Problem with Time Windows. This extension of the classical VRP consists of an unlimited h...
متن کاملCompetitive Vehicle Routing Problem with Time Windows and Stochastic Demands
The competitive vehicle routing problem is one of the important issues in transportation area. In this paper a new method for competitive VRP with time windows and stochastic demand is introduced. In the presented method a three time bounds are given and the probability of arrival time between each time bound is assumed to be uniform. The demands of each customer are different in each time wind...
متن کاملA tabu search for Time-dependent Multi-zone Multi-trip Vehicle Routing Problem with Time Windows
We propose a tabu search meta-heuristic for the Time dependent Multi-zone Multi-trip Vehicle Routing Problem with Time Windows. Two types of neighborhoods, corresponding to two decision sets of the problem, together with a strategy controlling the selection of the neighborhood type for particular phases of the search, provide the means to set up and combine exploration and exploitation capabili...
متن کاملA multi-criteria vehicle routing problem with soft time windows by simulated annealing
This paper presents a multi-criteria vehicle routing problem with soft time windows (VRPSTW) to mini-mize fleet cost, routes cost, and violation of soft time windows penalty. In this case, the fleet is heterogene-ous. The VRPSTW consists of a number of constraints in which vehicles are allowed to serve customers out of the desirable time window by a penalty. It is assumed that this relaxation a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: 4OR
سال: 2013
ISSN: 1619-4500,1614-2411
DOI: 10.1007/s10288-013-0238-z